Trading Throughput for Freshness: Freshness-aware Traffic Engineering and In-Network Freshness Control
نویسندگان
چکیده
With the advent of Internet Things (IoT), applications are becoming increasingly dependent on networks to not only transmit content at high throughput but also deliver it when is fresh , i.e., synchronized between source and destination. Existing studies have proposed metric age information (AoI) quantify freshness system designs that achieve low AoI. However, despite active research in this area, existing results applicable general wired for two reasons. First, they focus wireless settings, where AoI mostly affected by interference collision, while queueing issues more prevalent settings. Second, traditional high-throughput/low-latency legacy drop-adverse (LDA) flows taken into account most designs; hence, problem scheduling mixed with distinct performance objectives addressed. In article, we propose a hierarchical design treat shared flow traffic, specifically LDA flows, study characteristics achieving good tradeoff Our approach consists layers: freshness-aware traffic engineering (FATE) in-network control (IFC) . The centralized FATE solution derive sending rate/update frequency via optimization LDA-AoI Coscheduling parameters specified then distributed IFC, which implemented each outport network’s nodes used efficient flows. We present Linux implementation IFC demonstrate effectiveness FATE/IFC through extensive emulations. show possible trade little (5% lower) much shorter (49% 71% shorter) compared state-of-the-art engineering.
منابع مشابه
Freshness-Aware Thompson Sampling
To follow the dynamicity of the user’s content, researchers have recently started to model interactions between users and the ContextAware Recommender Systems (CARS) as a bandit problem where the system needs to deal with exploration and exploitation dilemma. In this sense, we propose to study the freshness of the user’s content in CARS through the bandit problem. We introduce in this paper an ...
متن کاملTrading Freshness for Performance in Distributed Systems
Many data management systems are faced with a constant, high-throughput stream of updates. In some cases, these updates are generated externally: a data warehouse system must ingest a stream of external events and update its state. In other cases, they are generated by the application itself: large-scale machine learning frameworks maintain a global shared state, which is used to store the para...
متن کاملImproving Route-Freshness
Ad-hoc routing protocols in mobile environments face a fundamental tradeoff between delay and communication overhead. Since routes become stale as nodes move, nodes need to frequently recompute routes, leading to an increase in control traffic overhead. In dealing with this tradeoff, protocols often adopt a fixed stance: some protocols assume frequent node movement, regularly recompute routes a...
متن کاملFreshness Seminar Presentation
This document is a slightly edited and expanded version of a presentation made at an Interwise seminar held on the 20th of April 2010. The topic of the seminar was the sensory evaluation of the freshness of fish as applied in quality control and quality assurance in commerce, the grading of fish for regulatory purposes, and in studies of properties of fish and the handling and processing of fis...
متن کاملCaching under Content Freshness Constraints
Several real-time delay-sensitive applications pose varying degrees of freshness demands on the requested content. The performance of cache replacement policies that are agnostic to these demands is likely to be sub-optimal. Motivated by this concern, in this paper, we study caching policies under a request arrival process which incorporates user freshness demands. We consider the performance m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM transactions on modeling and performance evaluation of computing systems
سال: 2023
ISSN: ['2376-3647', '2376-3639']
DOI: https://doi.org/10.1145/3576919